Decomposing Graphs with Symmetries
نویسندگان
چکیده
While decomposing graphs in simpler items greatly helps to design more efficient algorithms, some classes of graphs can not be handled using the classical techniques. We show here that a graph having enough symmetries can be factored into simpler blocks through a standard morphism and that the inverse process may be formalized as a pullback rewriting system.
منابع مشابه
Almost-symmetries of Graphs
Many successful uses of symmetries in discrete computational problems rely on group-theoretical properties. Almost-symmetries can be more numerous, but do not have the same properties. In this work, we study almost-symmetries of graphs, proposing data structures for representing them, algorithms for finding them, and logic predicates for symmetry-breaking.
متن کاملMinimum rainbow H-decompositions of graphs
Given graphs G and H, we consider the problem of decomposing a properly edge-colored graph G into few parts consisting of rainbow copies of H and single edges. We establish a close relation to the previously studied problem of minimum H-decompositions, where an edge coloring does not matter and one is merely interested in decomposing graphs into copies of H and single edges.
متن کاملSequences on Graphs with Symmetries
An interesting symmetry on multiplication of numbers found by Prof.Smarandache recently. By considering integers or elements in groups on graphs, we extend this symmetry on graphs and find geometrical symmetries. For extending further, Smarandache’s or combinatorial systems are also discussed in this paper, particularly, the CC conjecture presented by myself six years ago, which enables one to ...
متن کاملSymmetries of Hexagonal Molecular Graphs on the Torus
Symmetric properties of some molecular graphs on the torus are studied. In particular we determine which cubic cyclic Haar graphs are 1-regular, which is equivalent to saying that their line graphs are 1 2-arc-transitive. Although these symmetries make all vertices and all edges indistinguishable , they imply intrinsic chirality of the corresponding molecular graph.
متن کاملA Diffusion Equation with Exponential Nonlinearity Recant Developments
The purpose of this paper is to analyze in detail a special nonlinear partial differential equation (nPDE) of the second order which is important in physical, chemical and technical applications. The present nPDE describes nonlinear diffusion and is of interest in several parts of physics, chemistry and engineering problems alike. Since nature is not linear intrinsically the nonlinear case is t...
متن کامل